A Test Suite for Combinatorial Auctions

نویسندگان

  • Kevin Leyton-Brown
  • Yoav Shoham
چکیده

Many researchers have proposed algorithms for determining the winners of general combinatorial auctions, with encouraging results. (Some of these algorithms are described in Chapter 14 of this book.) This line of research has given rise to another problem, however. In order to evaluate—and thus to improve—such algorithms, it is necessary to use some sort of test data. Unfortunately, there is little data recording the behavior of real bidders upon which such test data may be built; furthermore, even as such data becomes available, algorithmic testing will require benchmarks which permit arbitrary scaling in the problem size. It is thus necessary to generate generate artificial data that is representative of the sort of scenarios one is likely to encounter.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Winner Determination in Combinatorial Auctions using Hybrid Ant Colony Optimization and Multi-Neighborhood Local Search

A combinatorial auction is an auction where the bidders have the choice to bid on bundles of items. The WDP in combinatorial auctions is the problem of finding winning bids that maximize the auctioneer’s revenue under the constraint that each item can be allocated to at most one bidder. The WDP is known as an NP-hard problem with practical applications like electronic commerce, production manag...

متن کامل

A test suite for the evaluation of mixed multi-unit combinatorial auctions

Mixed Multi-Unit Combinatorial Auctions extend and generalize all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical application of MMUCAs by: (1) providing an algorithm to generate artificial data that is representative of the sort of scenarios a winner determination algorithm is likely to encounter; and (2) subsequently assessing the performa...

متن کامل

A test suite for the evaluation of mixed multi-unit combinatorial auctions

Mixed Multi-Unit Combinatorial Auctions extend and generalize all the preceding types of combinatorial auctions. In this paper, we try to make headway on the practical application of MMUCAs by: (1) providing an algorithm to generate artificial data that is representative of the sort of scenarios a winner determination algorithm is likely to encounter; and (2) subsequently assessing the performa...

متن کامل

SATS: A Universal Spectrum Auction Test Suite

For the past 17 years, much of the work on combinatorial auctions (CAs) has used the Combinatorial Auction Test Suite (CATS) by Leyton-Brown et al. [24]. However, CATS does not include a good model for spectrum auctions, which have become the most important application of CAs. In this paper, we make four contributions. First, we propose the Multi-Region Value Model (MRVM) which captures the dif...

متن کامل

A mixed multi-unit combinatorial auctions test suite

Supply Chain Formation (SCF) is the process of determining the participants in a supply chain, who will exchange what with whom, and the terms of the exchanges. Mixed multi-unit combinatorial auctions (MMUCAs) offer a high potential to solve SCF problems, and thus be employed for the automated assembly of supply chains of agents. In this paper we present MMUCATS, a test suite for MMUCAs that al...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2005